A SAT-based Implementation for RPO Termination
نویسندگان
چکیده
This paper introduces a propositional encoding of the recursive path order (RPO) on terms which is a combination of a multiset path order and a lexicographic path order which considers permutations of the arguments in the lexicographic comparison. The proposed encoding allows us to use SAT solvers in order to determine whether a given term rewrite system is RPO terminating. An implementation is described.
منابع مشابه
Proving Termination Using Recursive Path Orders and SAT Solving
We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers permutations of the arguments in the lexicographic comparison. Our encoding allows us to apply SAT solvers in order to determine whether a given term rewrite system is RPO-terminating. Furthermore, to apply RPO within t...
متن کاملImplementing RPO and POLO using SAT
Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these classes have therefore been devised and implemented in termination tools. Unfortunately, for termination problems occurring in practice, the performance of existing algorithms is often insufficient. Performance can be improved sig...
متن کاملSAT encodings: from constraint-based termination analysis to circuit synthesis
Termination is one of the most prominent undecidable problems in computer science. At the same time, the problem whether a given program terminates for all inputs is sufficiently important for the area of program verification to spur decades-long efforts in developing sufficient criteria for concluding termination. In the last decade, the focus of this research has been on automation, giving ri...
متن کاملThe recursive path and polynomial ordering for first-order and higher-order terms
In most termination tools two ingredients, namely recursive path orderings (RPO) and polynomial interpretation orderings (POLO), are used in a consecutive disjoint way to solve the final constraints generated from the termination problem. In this paper we present a simple ordering that combines both RPO and POLO and defines a family of orderings that includes both, and extend them with the poss...
متن کاملSAT-based Termination Analysis for Java Bytecode with AProVE
SAT solvers are nowadays the standard solving engines for the search problems in automated termination analysis. Consequently, the performance of current termination tools heavily relies on the speed of modern SAT solvers on the corresponding SAT encodings. If a model for the SAT instance at hand is found, it can be used to instantiate the parameters for the current proof step to advance the te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000